Problem set - PDFSEARCH.IO - Document Search Engine

Problem set
Results: 1590

#	Item
851	ICFP Programming Contest 2009 Problem Specification University of Kansas June 28, 2009 Add to Reading List Source URL: www.ittc.ku.edu Language: English - Date: 2009-06-30 17:55:05 Assembly languages Addressing mode Machine code Instruction set Memory-mapped I/O RCA Computer architecture Computing Computer hardware
852	Astro 321: Problem Set 1 Due JanProblem 1: Units Add to Reading List Source URL: background.uchicago.edu Language: English - Date: 2011-08-15 18:34:55 Neutrino Cosmological constant Dark energy Electronvolt Cosmic microwave background radiation Friedmann equations Cosmic neutrino background Physics Physical cosmology Observable universe
853	Astro 242: Problem Set 7 1 Problem 1: Energy Conservation • Take the Liouville or collisionless Boltzmann equation in an expanding universe Add to Reading List Source URL: background.uchicago.edu - Date: 2015-03-20 18:07:12
854	Astro 305: Problem Set 1 Due Monday October 4 1 AGN jets Add to Reading List Source URL: background.uchicago.edu Language: English - Date: 2011-12-09 20:36:36 Electron Bremsstrahlung Physics Quantum electrodynamics Photon
855	Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe1 1 Yefim Dinitz2 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:42 Ordinal numbers Logic Ordinal arithmetic Set theory Curry–Howard correspondence Mathematical logic Proof theory Mathematics
856	Shortest Cut Graph of a Surface with Prescribed Vertex Set ´ Eric Colin de Verdi`ere⋆ ´ Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2010-06-23 07:19:49 Topological graph theory Network theory Planar graphs Algebraic graph theory Matroid theory Shortest path problem Dual graph Graph embedding Matroid Graph theory Mathematics Theoretical computer science
857	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
858	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:58:24 Spanning tree Network theory Shortest path problem Minimum spanning tree Theoretical computer science Graph theory Mathematics
859	Iowa State University Department of Computer Science Machine Learning (Com S 573) Vasant Honavar Spring 2010 Problem Set 2 Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2010-02-07 17:52:45 Statistical theory Auburn Hills Michigan Chrysler Dodge Likelihood function Maximum likelihood XK Estimation theory Statistics Bayesian statistics
860	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics

UPDATE